منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملMethod to Construct A-Codes from A-Codes
Another important idea in the study of codes is the relation between authentication codes with arbitration and authentication codes without arbitration. Nowadays there is no much work about this relation, very few authors have studied it. Then in this paper we are going to study this relation and come out some important results. For this cause we established and proved two theorems, which provi...
متن کاملHow to Construct Tetris Configurations
In this paper we show that every (reasonable) TETRIS configuration can be constructed from an initially empty game board using a suitable sequence of pieces. On game boards of even width a simple parity condition has to be fulfilled. The paper provides an explicit construction. This problem is connected to the NP-completeness of certain TETRIS related decision problems. INTRODUCTION It has rece...
متن کاملA Brief Introduction to Polar Codes
Figure 1: Factor Graph In particular, consider a setup where (U1, U2) are two equiprobable bits that are encoded into (X1, X2) = (U1 ⊕ U2, U2). Then, (X1, X2) are mapped to (Y1, Y2) by two independent BMS channels with transition probabilities P(Y1 = y |X1 = x) = P(Y2 = y |X2 = x) = W (y|x). The factor graph for this setup is shown in Figure 1. Since the mapping from (U1, U2) to (X1, X2) is inv...
متن کاملConvolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2272694